Termination proof of /tmp/tmpnWmu4W/pow.itrs

Termination of the given ITRSProblem could successfully be proven:

↳ ITRS

  ↳ ITRStoIDPProof

ITRS problem:
The following domains are used:

z

The TRS R consists of the following rules:

if(FALSE, x, y) → 1@z
pow(x, y) → if(>@z(y, 0@z), x, y)
if(TRUE, x, y) → *@z(x, pow(x, -@z(y, 1@z)))

The set Q consists of the following terms:

if(FALSE, x0, x1)
pow(x0, x1)
if(TRUE, x0, x1)

Added dependency pairs

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

I DP problem:
The following domains are used:

z

The ITRS R consists of the following rules:

if(FALSE, x, y) → 1@z
pow(x, y) → if(>@z(y, 0@z), x, y)
if(TRUE, x, y) → *@z(x, pow(x, -@z(y, 1@z)))

The integer pair graph contains the following rules and edges:

(0): IF(TRUE, x[0], y[0]) → POW(x[0], -@z(y[0], 1@z))
(1): POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1])

(0) -> (1), if ((-@z(y[0], 1@z) →^* y[1])∧(x[0] →^* x[1]))

(1) -> (0), if ((x[1] →^* x[0])∧(y[1] →^* y[0])∧(>@z(y[1], 0@z) →^* TRUE))

The set Q consists of the following terms:

if(FALSE, x0, x1)
pow(x0, x1)
if(TRUE, x0, x1)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

        ↳ IDP

          ↳ IDPNonInfProof

I DP problem:
The following domains are used:

z

R is empty.
The integer pair graph contains the following rules and edges:

(0): IF(TRUE, x[0], y[0]) → POW(x[0], -@z(y[0], 1@z))
(1): POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1])

(0) -> (1), if ((-@z(y[0], 1@z) →^* y[1])∧(x[0] →^* x[1]))

(1) -> (0), if ((x[1] →^* x[0])∧(y[1] →^* y[0])∧(>@z(y[1], 0@z) →^* TRUE))

The set Q consists of the following terms:

if(FALSE, x0, x1)
pow(x0, x1)
if(TRUE, x0, x1)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair IF(TRUE, x, y) → POW(x, -@z(y, 1@z)) the following chains were created:

We consider the chain POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1]), IF(TRUE, x[0], y[0]) → POW(x[0], -@z(y[0], 1@z)), POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1]) which results in the following constraint:
(1)    (-@z(y[0], 1@z)=y[1]1∧x[0]=x[1]1∧y[1]=y[0]∧x[1]=x[0]∧>@z(y[1], 0@z)=TRUE ⇒ IF(TRUE, x[0], y[0])≥NonInfC∧IF(TRUE, x[0], y[0])≥POW(x[0], -@z(y[0], 1@z))∧(U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥))

We simplified constraint (1) using rules (III), (IV) which results in the following new constraint:
(2)    (>@z(y[1], 0@z)=TRUE ⇒ IF(TRUE, x[1], y[1])≥NonInfC∧IF(TRUE, x[1], y[1])≥POW(x[1], -@z(y[1], 1@z))∧(U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (-1 + y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧-1 + (-1)Bound + (2)y[1] ≥ 0∧1 ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (-1 + y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧-1 + (-1)Bound + (2)y[1] ≥ 0∧1 ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (-1 + y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧-1 + (-1)Bound + (2)y[1] ≥ 0∧1 ≥ 0)

We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(6)    (-1 + y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧1 ≥ 0∧0 = 0∧-1 + (-1)Bound + (2)y[1] ≥ 0∧0 = 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧1 ≥ 0∧0 = 0∧1 + (-1)Bound + (2)y[1] ≥ 0∧0 = 0)

For Pair POW(x, y) → IF(>@z(y, 0@z), x, y) the following chains were created:

We consider the chain POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1]) which results in the following constraint:
(8)    (POW(x[1], y[1])≥NonInfC∧POW(x[1], y[1])≥IF(>@z(y[1], 0@z), x[1], y[1])∧(U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    ((U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥)∧0 ≥ 0∧0 ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    ((U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥)∧0 ≥ 0∧0 ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    (0 ≥ 0∧0 ≥ 0∧(U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥))

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    (0 = 0∧0 = 0∧(U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥)∧0 ≥ 0∧0 = 0∧0 = 0∧0 ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

IF(TRUE, x, y) → POW(x, -@z(y, 1@z))
- (y[1] ≥ 0 ⇒ (U^Increasing(POW(x[0], -@z(y[0], 1@z))), ≥)∧1 ≥ 0∧0 = 0∧1 + (-1)Bound + (2)y[1] ≥ 0∧0 = 0)
POW(x, y) → IF(>@z(y, 0@z), x, y)
- (0 = 0∧0 = 0∧(U^Increasing(IF(>@z(y[1], 0@z), x[1], y[1])), ≥)∧0 ≥ 0∧0 = 0∧0 = 0∧0 ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(-@z(x₁, x₂)) = x₁ + (-1)x₂
POL(POW(x₁, x₂)) = -1 + (2)x₂
POL(0@z) = 0
POL(TRUE) = 0
POL(FALSE) = -1
POL(IF(x₁, x₂, x₃)) = -1 + (2)x₃
POL(1@z) = 1
POL(undefined) = -1
POL(>@z(x₁, x₂)) = -1

The following pairs are in P_>:

IF(TRUE, x[0], y[0]) → POW(x[0], -@z(y[0], 1@z))

The following pairs are in P_bound:

IF(TRUE, x[0], y[0]) → POW(x[0], -@z(y[0], 1@z))

The following pairs are in P_≥:

POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1])

At least the following rules have been oriented under context sensitive arithmetic replacement:

-@z¹ ↔

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

        ↳ IDP

          ↳ IDPNonInfProof

            ↳ IDP

              ↳ IDependencyGraphProof

I DP problem:
The following domains are used:

z

R is empty.
The integer pair graph contains the following rules and edges:

(1): POW(x[1], y[1]) → IF(>@z(y[1], 0@z), x[1], y[1])

The set Q consists of the following terms:

if(FALSE, x0, x1)
pow(x0, x1)
if(TRUE, x0, x1)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.